Z4-linear Hadamard and extended perfect codes
نویسندگان
چکیده
منابع مشابه
Z4-linear Hadamard and extended perfect codes
If $N=2^k>8$ then there exist exactly $[(k-1)/2]$ pairwise nonequivalent $Z_4$-linear Hadamard $(N,2N,N/2)$-codes and $[(k+1)/2]$ pairwise nonequivalent $Z_4$-linear extended perfect $(N,2^N/2N,4)$-codes. A recurrent construction of $Z_4$-linear Hadamard codes is given.
متن کاملZ4-Linear Perfect Codes
For every n = 2 k ≥ 16 there exist exactly ⌊(k + 1)/2⌋ mutually nonequiv-alent Z 4-linear extended perfect codes with distance 4. All these codes have different ranks. Codes represented in such a manner are called Z 4-linear. In [5] it is shown that the extended Golay code and the extended Hamming (n, 2 n−log 2 n−1 , 4)-codes (of length n and cardinality 2 n−log 2 n−1 , with distance 4) for eve...
متن کاملPD-sets for Z4-linear codes: Hadamard and Kerdock codes
Permutation decoding is a technique that strongly depends on the existence of a special subset, called PD-set, of the permutation automorphism group of a code. In this paper, a general criterion to obtain s-PD-sets of size s + 1, which enable correction up to s errors, for Z4-linear codes is provided. Furthermore, some explicit constructions of s-PD-sets of size s+1 for important families of (n...
متن کاملProduct perfect Z2 Z4-linear codes in steganography
Product perfect codes have been proven to enhance the performance of the F5 steganographic method, whereas perfect Z2Z4-linear codes have been recently introduced as an efficient way to embed data, conforming to the ±1-steganography. In this paper, we present two steganographic methods. On the one hand, a generalization of product perfect codes is made. On the other hand, this generalization is...
متن کاملPartial permutation decoding for binary linear and Z4-linear Hadamard codes
Permutation decoding is a technique which involves finding a subset S, called PD-set, of the permutation automorphism group of a code C in order to assist in decoding. A method to obtain s-PD-sets of minimum size s + 1 for partial permutation decoding for binary linear Hadamard codes Hm of length 2 , for all m ≥ 4 and 1 < s ≤ ⌊ 2−m−1 1+m ⌋ , is described. Moreover, a recursive construction to o...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Electronic Notes in Discrete Mathematics
سال: 2001
ISSN: 1571-0653
DOI: 10.1016/s1571-0653(04)00161-1